Winner Determination in Sequential Majority Voting
نویسندگان
چکیده
Preferences can be aggregated using voting rules. We consider here the family of rules which perform a sequence of pairwise majority comparisons between two candidates. The winner thus depends on the chosen sequence of comparisons, which can be represented by a binary tree. We address the difficulty of computing candidates that win for some trees, and then introduce and study the notion of fair winner, i.e. candidates who win in a balanced tree. We then consider the situation where we lack complete informations about preferences, and determine the computational complexity of computing winners in this case.
منابع مشابه
A Sequential Voting with Externalities: Herding in Social Networks
We study sequential voting with two alternatives, in a setting with utility externalities: as usual, each voter has a private preference over the candidates and likes her favorite candidate to win, but additionally, a voter values voting for the chosen winner (which is determined by the majority or super-majority of votes). This model aims to capture voting behavior (”likes”) in social networks...
متن کاملSequential Elimination vs. Instantaneous Voting
Voting procedures eliminating candidates sequentially and one-at-a-time based on repeated ballots are superior to well-known single-round voting rules: if voters are strategic the former will induce the Condorcet winner in unique equilibrium, whereas the latter may fail to select it. In addition, when there is no Condorcet winner the outcome of sequential elimination voting always belongs to th...
متن کاملAggregating preferences in multi-issue domains by using maximum likelihood estimators
In this paper, we study a maximum likelihood estimation (MLE) approach to voting when the set of alternatives has a multi-issue structure, and the voters’ preferences are represented by CP-nets. We first consider general multi-issue domains, and study whether and how issue-by-issue voting rules and sequential voting rules can be represented by MLEs. We first show that issue-by-issue voting rule...
متن کاملSample Complexity for Winner Prediction in Elections
Predicting the winner of an election is a favorite problem both for news media pundits and computational social choice theorists. Since it is often infeasible to elicit the preferences of all the voters in a typical prediction scenario, a common algorithm used for winner prediction is to run the election on a small sample of randomly chosen votes and output the winner as the prediction. We anal...
متن کاملFishing out Winners from Vote Streams
We investigate the problem of winner determination from computational social choice theory in the data stream model. Specifically, we consider the task of summarizing an arbitrarily ordered stream of n votes on m candidates into a small space data structure so as to be able to obtain the winner determined by popular voting rules. As we show, finding the exact winner requires storing essentially...
متن کامل